منابع مشابه
Suprathreshold Color-Difference Ellipsoids for Surface Colors
The RIT–DuPont visual color-difference data as the RIT–DuPont data set, and they are the basis for [Color Res. Appl. 16, 297–316 (1991)] have been used our current analyses. to estimate contours of equal color-differences (ellipThe RIT–DuPont data set consists of 156 tolerances, soids) at 19 color centers, in CIELAB and x , y , Y /100 each of equal visual color difference, DV . Nineteen color c...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملEffect of Chromatic Components on Facial Skin Whiteness
Although the color measurement of facial skin becomes more common in dermatology and cosmetics, little is known about the relationship between subjective color perception and colorimetric values in facial skin. In this study, the possible relationships among perceived whiteness and the metric lightness, chroma and hue angle of Japanese females’ facial skin color were investigated. First, the pe...
متن کاملMounting of Surface Mount Components
Over the past few year, electronic products, and especially those which fall within the category of Consumer Electronics, have been significantly reduced in physical size and weight. Products such as cellular telephones, lap-top computers, pagers, camcorders, etc., have been reduced by as much as 3/4 of their original introductory size and weight. The most significant contributing factor to thi...
متن کاملChromatic polynomials of some nanostars
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Illuminating Engineering Institute of Japan
سال: 1992
ISSN: 0019-2341,1349-838X,2185-1506
DOI: 10.2150/jieij1980.76.appendix_78